Low-error fixed-width modified booth multiplier

ABSTRACT

A low-error fixed-width multiplier receives a W-bit input and produces a W-bit product. In an embodiment, a multiplier (Y) is encoded using modified Booth coding. The encoded multiplier (Y) and a multiplicand (X) are processed together to generate partial products. The partial products are accumulated to generate a product (P). To compensate for the quantization error, Booth encoder outputs are used for the generation of error compensation bias. The truncated bits are divided into two groups, a major least significant bit group and a minor least significant bit group, depending upon their effects on the quantization error. Different error compensation methods are applied to each group.

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] This application claims the benefit of U.S. Provisional Application No. 60/371,149, filed Apr. 10, 2002, which is incorporated herein by reference in its entirety.

FIELD OF THE INVENTION

[0002] The present invention relates to data processing. More particularly, it relates to fixed-width multiplication of data.

BACKGROUND OF THE INVENTION

[0003] In many multimedia and digital signal processing (DSP) applications, for example, multiplication operations have a fixed-width property. This property means that input data and output results for multiplication operations have the same bit width. In order to implement this fixed-width property, in many multimedia and DSP applications the “2W−1” bit product obtained from a W-bit multiplicand and a W-bit multiplier is quantized to W-bits by eliminating the “W−1” least-significant bits.

[0004] In typical fixed-width multipliers, which are used to implement the fixed-width property, the adder cells required for the computation of the “W−1” least-significant bits are omitted and biases are introduced into the retained adder cells. Several conventional fixed-width multiplier schemes and/or designs such as, for example, Baugh-Wooley multipliers or parallel array multipliers exist. (See, e.g., S. S. Kidambi et al., “Area-efficient multipliers for digital signal processing applications,” IEEE Trans. Circuits Syst. II, vol. 43, pp. 90-94 (February 1996); J. M. Jou and S. R. Kuang, “Design of a low-error fixed-width multiplier for DSP applications,” Electron. Lett., vol. 33, no. 19, pp. 1597-1598 (1997); L. D. Van et al., “Design of the lower error fixed-width multiplier and its applications,” IEEE Trans. Circuits Syst. II, vol. 47, pp. 1112-1118 (October 2000); and S. J. Jou and H. H. Wang, “Fixed-width multiplier for DSP application,” in Proceedings of 2000 ICCD (Austin, Tex.), pp. 318-322 (September 2000); each of which is incorporated herein in its entirety.)

[0005] Each of the conventional fixed-width multiplier schemes and/or designs, however, introduces errors into the multiplication output results, which for certain applications are significant. For example, Kidambi et al. relates to a constant bias scheme wherein a constant bias is added to the retained cells. This constant bias scheme cannot be adjusted adaptively by the input signals, however, and the resulting truncation error is typically large. In Jou and Kuang and in Van et al., error compensation biases are generated using an indexing scheme. The indices used in these schemes attempt to incorporate the effects of the input signals and thus are an improvement over Kidambi et al. However, although quantization errors may be reduced by using indices, these schemes still have limitations that introduce errors into the multiplication output results, which for certain applications are significant. In Jou and Wang, statistical analysis and linear regression analysis are used to generate a bias that is added to retained adder cells. This scheme, however, also introduces errors into the multiplication output results, which for certain applications are significant. Thus, there is a need for new schemes and/or designs that do not have the limitations of the conventional schemes and/or designs.

[0006] What is needed is a new lower-error fixed-width multiplier, and a method for designing the same, that overcomes the limitations of the conventional fixed-width multiplier schemes and/or designs.

BRIEF SUMMARY OF THE INVENTION

[0007] A fixed-width multiplier receives a W-bit input and produces a W-bit product. In an embodiment, a multiplier (Y) is encoded using modified Booth coding. The encoded multiplier (Y) and a multiplicand (X) are processed together to generate partial products. The partial products are accumulated to generate a product (P). To compensate for the quantization error, Booth encoder outputs are used for the generation of error compensation bias. The truncated bits are divided into two groups, a major least significant bit group and a minor least significant group, depending upon their effects on the quantization error. Different error compensation methods are applied to each group.

[0008] In embodiments of the invention, fixed-width modified Booth multiplication is accomplished as follows. A W-bit multiplier is encoded using modified Booth coding. The encoded multiplier and a multiplicand are process to generate partial products. The partial products are accumulated to generate a W-bit product. This accumulation is achieved by dividing truncated bits into two groups, a major least significant bit group and a minor least significant bit group. An approximate carry value is generated using the bits of the minor least significant bit group. An exact carry value for the major least significant bit group is generated using the approximate carry value and the bits of the major least significant bit group.

[0009] In one embodiment, an output of a Booth encoder is used to generate the approximate carry value. In another embodiment, a plurality of adder circuit carry signals are used to generate the approximate carry value.

[0010] In embodiments, several adder circuits are used to accumulate more than W most significant bits, and the resultant product is truncated or rounded to form a W-bit product or longer-than-W-bit product.

[0011] In some embodiments of the invention, fixed-width modified Booth multiplication is accomplished in accordance with the following steps. A modified Booth encoded multiplier and a multiplicand are processed to generate at least a first group of N partial products and a second group of N partial products. Each partial product of the first and second groups of N partial products is associated with a most significant bit group, a major least significant bit group, or a minor least significant bit group. An approximate carry value is generated for the minor least significant bit group. An exact carry value is generated for the major least significant bit group using the approximate carry value and the value of each partial product associated with the major least significant bit group. A product is generated for the most significant bit group using the exact carry value and the value of each partial product associated with the most significant bit group.

[0012] In embodiments, a fixed-width modified Booth multiplier according to the invention includes a module that encodes a W-bit multiplier using modified Booth coding, a module that processes the encoded multiplier and a multiplicand to generate partial products, and a module that accumulates the partial products to generate a W-bit product. The module that accumulates the partial products includes means for associating truncated bits with a major least significant bit group or a minor least significant bit group, means for generating an approximate carry value using the bits associated with the minor least significant bit group, and means for generating an exact carry value using the approximate carry value and the bits associated with the major least significant bit group.

[0013] In embodiments, a fixed-width multiplier according to the invention includes a modified Booth encoder circuit and a partial product generation circuit. In one embodiment, a plurality of digital logic circuits are used to generate the approximated carry value. In an embodiment, a plurality of adder circuits are used to generate the approximated carry value.

[0014] In one aspect of the invention, the following method steps are used to design fixed-width multipliers according to embodiments of the invention. A plurality of partial products formed for a W-bit multiplier and a W-bit multiplicand during modified Booth multiplication are identified. Each of these partial products is associated with a most significant bit group, a major least significant bit group, or a minor least significant bit group. A circuit is designed that generates an approximate carry value based on partial product values of the partial products associated with the minor least significant bit group. A circuit is designed that generates an exact carry value based on partial product values of the partial products associated with the major least significant bit group and an output of the circuit that generates an approximate carry value. A circuit is designed that generates a product value based on partial product values of the partial products associated with the most significant bit group and an output of the circuit that generates an exact carry value.

[0015] In embodiments, the design step of designing a circuit that generates an approximate carry value is performed as follows. A plurality of coded values y″_(w/2-2), y″_(w/2-3), . . . , y″₁ and y″₀ are formed. A number (N_(AC)) of approximate carry signals (a_carry_(—)0, a_carry_(—)1, . . . , a_carry_N_(AC−1)) to be generated by an approximate carry generation circuit is selected. A value of 1 is assigned to an approximate carry signal (a_carry_i) if at least “2i+1” of the coded values y″_(w/2-2), y″_(w/2-3), . . . , y″₁ and y″₀ have a value of 1. A circuit design technique is applied to the assigned values of the approximate carry signals (a_carry_(—)0, a_carry_(—)1, . . . , a_carry_N_(AC−1)) to design the approximate carry generation circuit. In one embodiment, this step involves applying a Karnaugh map design technique.

[0016] Further embodiments, features, and advantages of the present invention, as well as the structure and operation of the various embodiments of the present invention are described in detail below with reference to accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS/FIGURES

[0017] The present invention is described with reference to the accompanying figures. In the figures, like reference numbers indicate identical or functionally similar elements. Additionally, the left-most digit or digits of a reference number identify the figure in which the reference number first appears. The accompanying figures, which are incorporated herein and form part of the specification, illustrate the present invention and, together with the description, further serve to explain the principles of the invention and to enable a person skilled in the relevant art to make and use the invention.

[0018]FIG. 1 illustrates a flowchart of the steps of a method for modified Booth multiplication according to an embodiment of the invention.

[0019]FIG. 2 is a table illustrating modified Booth coding according to an embodiment of the invention.

[0020]FIG. 3 illustrates an example grouping of bits for a modifier Booth encoder.

[0021]FIG. 4 illustrates an example encoder circuit for a modifier Booth encoder.

[0022]FIG. 5 is a Table illustrating example partial products according to an embodiment of the invention.

[0023]FIG. 6 illustrates how to add partial products according to an embodiment of the invention.

[0024]FIG. 7 illustrates an example partial product generation circuit according to an embodiment of the invention.

[0025]FIG. 8 is a Table illustrating partial product bits according to an embodiment of the invention.

[0026]FIG. 9 illustrates a grouping of partial product bits according to an embodiment of the invention.

[0027]FIG. 10 illustrates an example fixed-width modified Booth multiplier structure according to an embodiment of the invention.

[0028]FIG. 11 is a Table illustrating modified Booth coding according to an embodiment of the invention.

[0029]FIG. 12 illustrates three different partial products for three coded words according to an embodiment of the invention.

[0030]FIG. 13 is a Table illustrating rounded values according to an embodiment of the invention.

[0031]FIG. 14 is a Table illustrating approximate carry values according to an embodiment of the invention.

[0032]FIG. 15A is Karnaugh map representation for an approximate carry value according to an embodiment of the invention.

[0033]FIG. 15B is Karnaugh map representation for an approximate carry value according to an embodiment of the invention.

[0034]FIG. 16A is Karnaugh map representation for an approximate carry value according to an embodiment of the invention.

[0035]FIG. 16B is Karnaugh map representation for an approximate carry value according to an embodiment of the invention.

[0036]FIG. 17 is an example approximate carry generation circuit according to an embodiment of the invention.

[0037]FIG. 18A is a graph illustrating the performance of a modified Booth multiplier according to an embodiment of the invention.

[0038]FIG. 18B is a graph illustrating the performance of a conventional modified Booth multiplier.

[0039]FIG. 19 is a Table illustrating a comparison of the performance of various quantization schemes.

[0040]FIG. 20 is a Table illustrating a comparison of the normalized performance of various quantization schemes.

[0041]FIG. 21 illustrates a flowchart of the steps of a generalized approximate carry generation procedure I (ACGP I) according to an embodiment of the invention.

[0042]FIG. 22 is a Table illustrating approximate carry values according to an embodiment of the invention.

[0043]FIG. 23 is a Table illustrating a comparison of the performance of various quantization schemes.

[0044]FIG. 24 is a Table illustrating a comparison of the performance of various quantization schemes.

[0045]FIG. 25 is a Table illustrating a comparison of the performance of various quantization schemes.

[0046]FIG. 26 is a Table illustrating Synopsys results for an embodiment of the invention and a conventional modified Booth multiplier system.

[0047]FIG. 27 is a Table illustrating Synopsys results for an embodiment of the invention and a conventional modified Booth multiplier system.

[0048]FIG. 28 illustrates a flowchart of the steps of a generalized approximate carry generation procedure II (ACGP II) according to an embodiment of the invention.

[0049]FIG. 29A illustrates an example half adder circuit according to an embodiment of the invention.

[0050]FIG. 29B illustrates an example full adder circuit according to an embodiment of the invention.

[0051]FIG. 30 illustrates a comparison of approximate carry signals generated in accordance with two embodiments of the invention.

[0052]FIG. 31A illustrates an example approximate carry generation circuit according to an embodiment of the invention.

[0053]FIG. 31B illustrates an example approximate carry generation circuit according to an embodiment of the invention.

[0054]FIG. 32 illustrates a comparison of Synopsys simulation results in accordance with two embodiments of the invention.

DETAILED DESCRIPTION OF THE INVENTION

[0055] Introduction

[0056] The present invention provides an efficient, low-error, fixed-width modified Booth multiplier and a method for designing the same.

[0057] In embodiments, a multiplier (Y) is encoded using modified Booth coding. The encoded multiplier (Y) and a multiplicand (X) are processed together to generate partial products. The bits of the generated partial products are divided into three groups, a most significant bit group, a major least significant bit group, and a minor least significant bit group. The bits of the minor least significant bit group are used to generate a first bias (an approximate carry value). This first bias and the bits of the major least significant bit group are used to generate a second bias (an exact carry value). In embodiments, different error compensation methods are applied to the bits of the minor least significant bit group and the bits of the major least significant bit group to generate the first bias and the second bias. The second bias and the bits of the most significant bit group are used to generate a fixed-width product (P).

[0058] In embodiments, Booth encoder outputs are used for the generation of a compensation bias rather than, for example, multiplier coefficients. This allows efficient compensation for the quantization error with reduced hardware complexity. Simulation results show that significant reductions in truncation error are achieved using the present invention in comparison to conventional fixed-width multipliers such as, for example, the fixed-width modified Booth multiplier described in Jou and Wang. (See Jou and Wang, “Fixed-width multiplier for DSP application,” in Proceedings of 2000 ICCD (Austin, Tex.), pp. 318-322 (September 2000)).

[0059] The present invention will now be described in detail with reference to the accompanying figures.

[0060] Modified Booth Multiplier

[0061] In accordance with the present invention, the acceleration of the process of multiplication is based on two main techniques. The first technique is reducing the number of the partial products. The second technique is accelerating the summation of the partial products. Modified Booth coding is one of the most widely used techniques for reducing the number of partial products. (See MacSorley, O. L., “High speed arithmetic in binary computers,” Proc. IRE, vol. 49, pp. 67-91 (January 1961), which is incorporated by reference herein in its entirety.)

[0062]FIG. 1 is a flowchart of the steps of a method 100 according to the present invention that illustrates the operation of a modified Booth multiplier. In embodiments, method 100 operates as follows. In step 102 of method 100, a multiplier (Y) is encoded using modified Booth coding. This encoding involves appending a zero bit to a two's complement representation of the multiplier (Y). In step 104, the encoded multiplier (Y) and a multiplicand (X) are processed together to generate partial products. This processing involves adding and/or subtracting multiples of the multiplicand (X) to a sum of partial products and right-shifting the result. In embodiments, these operations can be performed using an encoder circuit and a partial product generation circuit. In step 106, the partial products generated in step 104 are accumulated according to the present invention to generate a product (P).

[0063] An advantage of method 100 compared to other multiplication methods is that fewer partial products are generated in step 104 than would otherwise be generated. To better understand the operation of a modified Booth multiplier, consider the multiplication of two 2's complement W-bit numbers X and Y, wherein X and Y are given by EQ. (1). $X = {{- x_{w - 1}} + {\sum\limits_{i = 1}^{W - 1}\quad {x_{w - 1 - i}2^{- i},}}}$

$\begin{matrix} {Y = {{- y_{w - 1}} + {\sum\limits_{i = 1}^{W - 1}\quad {y_{w - 1 - i}2^{- i},}}}} & {{EQ}.\quad (1)} \end{matrix}$

[0064] For modified Booth coding, ‘0’ must always be concatenated to the right of Y, and W should be even. By modified Booth coding, Y is expressed as: $\begin{matrix} {{Y = {\sum\limits_{i = 0}^{{W/2} - 1}\quad {y_{{W/2} - 1 - i}^{\prime}2^{- {({{2i} + 1})}},}}}{where}} & {{EQ}.\quad (2)} \\ {y_{i}^{\prime} = {{{- 2}y_{{2i} + 1}} + y_{2i} + {y_{{2i} - 1}.}}} & {{EQ}.\quad (3)} \end{matrix}$

[0065] Table I in FIG. 2 summarizes the coding operation of EQ. (3).

[0066]FIG. 3 and FIG. 4 illustrate a simple modified Booth encoder. FIG. 3 illustrates a grouping of multiplier bits for “W” equal to 8. FIG. 4 illustrates an example encoder circuit 400. An example encoder circuit having low-power consumption is described in Nicol and Larsson. (See Nicol, C. J. and Larsson, P., “A low-power multiplication for FIR filters,” in Proceedings of IEEE Int. Symp. Low Power Electronic and Design, (Monterey, Calif.), pp. 76-79, (August 1997), which is incorporated by reference herein in its entirety.)

[0067] For “W” equal to 8, Table II in FIG. 5 illustrates the partial product corresponding to each encoded y′_(i). FIG. 6 and FIG. 7 show the partial products and a partial product generation circuit 700, respectively.

[0068] Using Table I (see FIG. 2) and the partial product generation circuit 700 in FIG. 7, the partial product bits for all the possible combinations of x_(i)'s and y_(i)'s can be obtained as shown in Table III in FIG. 8.

[0069] Fixed-Width Multiplier

[0070] In accordance with the present invention, partial products for a modified Booth multiplier can be divided into most significant products (MP) and least significant products (LP) as shown in FIG. 9. This division facilitates accelerating the summation of the partial products generated in step 104 of method 100. As noted above, accelerating the summation of partial products is a second technique used for acceleration of the process of multiplication.

[0071] In order to generate error compensation biases more efficiently, LP is further subdivided into LP_(major), and LP_(minor) as shown in FIG. 9. This allows a (2W−1)-bit ideal product P_(I) to be expressed as: $\begin{matrix} {{{P1} = {{S\_ MP} + {{S\_ LP},}}}\quad {where}} & {{EQ}.\quad (4)} \\ {{{S\_ MP} = {\sum\limits_{\quad {{{2W} - 2} \geq {{2i} + j} \geq {W - 1}}}^{\quad}\quad {p_{i,\quad j}2^{- {({{2W} - 2 - {2i} - j})}},}}}\quad {and}} & {{EQ}.\quad (5)} \\ {{S\_ LP} = {{\sum\limits_{{W - 1} \geq {{2i} + j} \geq 0}^{\quad}\quad {p_{i,\quad j}2^{- {({{2W} - 2 - {2i} - j})}}}} + {\sum\limits_{i = 0}^{{W/2} - 1}\quad {n_{i,\quad 0}2^{- {({{2W} - 2 - {2i}})}}}}}} & {{EQ}.\quad (6)} \end{matrix}$

[0072] Notice that S_MP and S_LP represents the sum of the elements in MP and LP, respectively.

[0073] As is the case with typical fixed-width multipliers, in embodiments, the adder cells required for S_LP are omitted and appropriate biases are introduced to the retained adder cells based on a probabilistic estimation. Thus, the W-bit quantized product P_(Q) can be expressed as:

P _(Q) =S _(—) MP+σ×2^(−(W−1)),  EQ. (7)

[0074] where σ, represents the error-compensation bias. Notice that σ approximates the carry signals propagated from LP to MP.

[0075] In Jou and Wang, an error compensation bias is defined using a statistical analysis as the sum of the elements in LP_(major). For example, for a modified Booth multiplier with W equal to 8, σ_(jou) is computed as:

σ_(jou) =p _(0,6) +p _(1,4) +p _(2,2) +p _(3,0) +n _(3,0).  EQ. (8)

[0076] Error Compensation Method

[0077] As shown in FIG. 9, S_LP can be expressed as:

S _(—) LP=S _(—) LP _(major) +S _(—) LP _(minor)  EQ. (9)

[0078] If S_LP′ is defined as:

S _(—) LP′=S _(—) LP×2W,  EQ. (10)

[0079] S_LP′_(major) and S_LP′_(minor) can be expressed as:

S _(—) LP′ _(major) =p _(0,6) +p _(1,4) +p _(2,2) +p _(3,0) +n _(3,0).  EQ. (11)

and

S _(—) LP′ _(minor)=2⁻¹(p _(0,5) +p _(1,3) +p _(2,1))+2⁻²(p _(0,4) +p _(1,2) +p _(2,0) +n _(2,0))+2⁻³(p _(0,3) +p _(1,1))+2⁻⁴(p _(0,2) +p _(1,0) +n _(1,0))+2⁻⁵(p _(1,0))+2⁻⁶(p _(1,0) +n _(0,0)).  EQ. (12)

[0080] Notice that LP_(major) has dominant effect on the carry signals generated from the LP part since LP_(major) has the largest weight in the LP part. In embodiments, to simplify the error compensation circuit, each element in LP_(minor) is assumed as a random variable.

[0081] A fixed-width modified Booth multiplier structure according to the invention is illustrated in FIG. 10. The error compensation bias is given by EQ. (13):

σ_(prop) =CE[S _(—) LP′ _(major) +C _(A) [S _(—) LP′ _(minor)]],  EQ. (13)

[0082] where C_(E)[t] represents the exact carry value of t and C_(A)[t] represents the approximate carry value of t. Notice that, in EQ. (13), C_(A)[S_LP′_(minor)] computes an approximate carry value from LP_(minor) to LP_(major). C_(A)[t] is described in more detail below.

[0083] In accordance with embodiments of the invention, an error compensation bias is obtained as follows:

[0084] 1. Divide LP into LP_(major) and LP_(minor).

[0085] 2. Compute the approximate carry value from LP_(minor).

[0086] 3. Add the approximate carry value to S_LP′_(major).

[0087] The carry value obtained from the addition in step 3 is the desired error compensation bias.

[0088] Approximate Carry Generation

[0089] In this section, two approximate carry generation methods are described. Following the descriptions of these methods, a generalized approximate carry generation method is presented.

[0090] Approximate Carry Generation by Exhaustive Simulation

[0091] For the description that follows, consider a value y″_(i), where y″_(i) is defined as: $\begin{matrix} {y_{i}^{''} = \left\{ \begin{matrix} {1,} & {{{if}\quad y_{i}^{\prime}} \neq {0,}} \\ {{0,}\quad} & {{otherwise}.} \end{matrix} \right.} & {{EQ}.\quad (14)} \end{matrix}$

[0092] From Table I (see FIG. 2), it can be shown that y″, is computed as:

y″ _(i) =X _(i) _(—) _(sel)

2X _(i) ^(_(—)) _(sel),  EQ. (15)

[0093] where

means OR operation. For example, if y″₃y″₂y″₁y″₀ for a coded number y′₃y′₂y′y′₀ is 1000, the coded number should have one of the following four values: 1000, 2000, {overscore (1)}000, and {overscore (2)}000.

[0094] Table IV in FIG. 11 shows modified Booth coding for 8-bit numbers that have at least one nonzero bit in the most significant 3-bit positions. From Table IV, it is concluded that there are only three 8-bit numbers which can have y″₃y″₂y″₁y″₀=1000 (i.e., 01000000(0), 10000000(0), and 11000000(0)). As another example, it can be shown that only the following three 8-bit numbers can have y″₃y″₂y″₁y″₀=0001:

11111110(0)→y′ ₃ y′ ₂ y′ ₁ y′ ₀=0001,

11111110(0)→y′ ₃ y′ ₂ y′ ₁ y′ ₁ y′ ₀=000{overscore (2)},

11111111(0)→y′ ₃ y′ ₂ y′ ₁ y′ ₀=000{overscore (1)}.  EQ. (16)

[0095]FIG. 12 illustrates the partial products for the three multiplier coefficients corresponding to y″₃y″₂y″₁y″₀=0001. If it is assumed that each bit of input X has a uniform probability distribution, the expected value of x_(i) is:

E[x _(i)]=1/2.  EQ. (17)

[0096] Thus, the rounded value of E[S_LP′_(minor)] for each of the three cases in FIG. 12 can be computed as follows: $\begin{matrix} {\left\{ {E\left\lbrack {S\_ LP}_{minor}^{\prime} \right\rbrack} \right\}_{r} = \left\{ \begin{matrix} {{0,}\quad} & {{{for}\quad y_{3}^{\prime}y_{2}^{\prime}y_{1}^{\prime}y_{0}^{\prime}} = 0001} \\ {{1,}\quad} & {{{for}\quad y_{3}^{\prime}y_{2}^{\prime}y_{1}^{\prime}y_{0}^{\prime}} = {000\overset{\_}{1},\quad 000\overset{\_}{2},}} \end{matrix} \right.} & {{EQ}.\quad (18)} \end{matrix}$

[0097] where [t]_(r), means a rounding operation for t.

[0098] Notice that E[S_LP′_(minor)] is always zero for the three numbers with y″₃y″₂y″₁y″₀=1000. In other words, y′₃ does not have any effect on E[S_LP′_(minor)] since no element of the partial product corresponding to y′₃ is included in LP_(minor) as can be seen from FIG. 9.

[0099] From the above description, it follows that the value of E[S_LP′_(minor)] is determined by coded multiplier coefficients. In accordance with the invention, to determine error compensation biases more accurately, {E[S_LP′_(minor)]}_(r) is computed for each y″_(W/2-2)y″_(w/2-3) . . . y″₀.

[0100] An approximate carry generation circuit can be designed based on the computed {E[S_LP′_(minor)]}_(r) values. This procedure is further described using the following example.

EXAMPLE 1

[0101] Consider a modified Booth multiplication with W=10. Since, for W=10,

E[S _(—) LP′ _(minor)]=2⁻¹(y″ ₃ +y″ ₂ +y″ ₁ +y″ ₀),  EQ. (18)

[0102] the maximum rounded value of E[S_LP′_(minor)] is 2. Table V in FIG. 13 shows the rounded values of E[S_LP′_(minor)] for all the possible values of y″₃y″₂y″₁y″₀. Notice that y, is not shown in Table V since it does not have any effect on E[S_LP′_(minor)].

[0103] As shown in Table VI in FIG. 14, two approximate carry signals (e.g., a_carry_(—)0 and a_carry_(—)1) are needed to represent the rounded values in Table V (see FIG. 13). From Tables V and VI, Karnaugh map representations for the approximate carry signals (a_carry_(—)0 and a_carry_(—)1) can be obtained as shown in FIG. 15A and FIG. 15B. The don't-care conditions (X's) in FIG. 15A and FIG. 15B can be determined using probability analysis. For example, for y″₃y″₂y″₁y″₀=0001, Pr[x=0]=4/12 and Pr[x=1]=8/12. Thus the don't-care condition corresponding to y″₃y″₂y″₁y″₀=0001 is determined to be 1. In a similar fashion, it can be shown that each don't care condition (i.e., X) in FIG. 15A and FIG. 15B is determined to be 1 by probability analysis. Using the maps in FIG. 16A and FIG. 16B, wherein each don't care condition (i.e., X) is replaced by the value 1, the a_carry_(—)0 and a_carry_(—)1 signals can be obtained as:

a _(—) carry _(—)0=y″ ₃

y″ ₂

y″ ₁

y″ ₀,

a _(—) carry _(—)1=y″ ₃ y″ ₂(y″ ₁

y″ ₀)

y″ ₁ y″ ₀(y″ ₃

y″ ₂).  EQ. (19)

[0104] An example circuit 1700 for implementing EQ. (19) is shown in FIG. 17. The approximate carry signals are added to LP_(major). Then, the resulted carry signals from LP_(major) are added to MP as error compensation bias.

[0105] The enhanced performance of fixed-width multipliers according to embodiments of the invention is demonstrable. Consider, for example, for each 10-bit coefficient of example 1, the average of the absolute quantization error ε (defined as ε=|P_(I)−P_(Q)|) for all the 10-bit input words. FIG. 18A and FIG. 18B illustrate the average error plots obtained by fixed-width multipliers according to embodiments of the invention (σ_(invention)) and by the fixed-width multiplier of Jou and Wang (σ_(Jou)), respectively. Table VII in FIG. 19 compares the averages and variances of absolute error for various quantization schemes. Table VIII in FIG. 20 compares the averages and variances normalized by the average and variance of rounding operation. Notice that the average of ε by σ_(invention) is about fifty percent (50%) of that of σ_(Jou).

[0106] Approximate Carry Generation by Statistical Analysis

[0107] Consider FIG. 9 again. Given that y″_(i) is 1, using Table I in FIG. 2 and Table III in FIG. 8, it can be shown that E[p_(ij)]=1/2. If y″₂y″₁y″₀=100 in FIG. 9, using EQ. (12), E[S_LP′_(minor)] is computed as $\begin{matrix} \begin{matrix} {{E\left\lbrack {S\_ LP}_{minor}^{\prime} \right\rbrack} = {{E\left\lbrack {{2^{- 1}\left( p_{2,\quad 1} \right)} + {2^{- 2}\left( {p_{2,\quad 0} + n_{2,\quad 0}} \right)}} \right\rbrack},}} \\ {= {{2^{- 1}\left( 2^{- 1} \right)} + {2^{- 2}\left( {2^{- 1} + 2^{- 1}} \right),}}} \\ {= {2^{- 1}.}} \end{matrix} & {{EQ}.\quad (20)} \end{matrix}$

[0108] In a similar fashion, for t″₂y″₁y″₀=010 and y″₂y″₁y″₀=001, it can be shown that E[S_LP′_(minor)]=2⁻¹. Thus, for W=8, E[S_LP′_(minor)] can be expressed as:

E[S _(—) LP′ _(minor)]=2⁻¹(y″ ₂ +y″ ₁ +y″ ₀).  EQ. (21)

[0109] For general W, EQ. (21) can be extended and expressed as: $\begin{matrix} {{E\left\lbrack {S\_ LP}_{minor}^{\prime} \right\rbrack} = {2^{- 1} \cdot {\sum\limits_{i = 0}^{{W/2} - 2}\quad {y_{i}^{''}.}}}} & {{EQ}.\quad (22)} \end{matrix}$

[0110] To compute the approximate carry, the rounded value of E[S_LP′_(minor)] needs to be computed. How this is accomplished is further described using Example 2.

EXAMPLE 2

[0111] Consider the computation of the rounded value of E[S_LP′_(minor)] for W=10. Since for W=10, as noted above,

E[S _(—) LP′ _(minor)]=2⁻¹(y″ ₃ +t″ ₂ +y″ ₁ +y″ ₀),  EQ. (23)

[0112] the maximum rounded value of E[S_LP′_(minor)] is 2. Thus, two signals are needed to represent the rounded value. If at least one y″₁ is 1 in EQ. (23), the rounded value is greater than or equal to 1. If at least three y″₁'s are 1, the rounded value is 2. Then, if the notations given in Table VI in FIG. 11 are used, the Karnaugh maps in FIG. 16A and FIG. 16B can be obtained based on the above observations. Thus, the same example approximate carry generation circuit 1700 illustrated in FIG. 17 can be obtained.

[0113] Approximate Carry Generation Procedure I (ACGP I)

[0114]FIG. 21 illustrates a flowchart of the steps of a generalized approximate carry generation procedure I (ACGP I) or method 2100 according to an embodiment of the invention. Method 2100 is based on the description of the invention above.

[0115] As illustrated in FIG. 21, method 2100 (i.e., ACGP I) comprises four steps 2102, 2104, 2106, and 2108. In step 2102, for a given W, the number of approximate carry signals is determined as N_(AC)={W/4−1/2}_(r). In step 2104, the approximate carry signals are denoted as a_carry_(—)0, a_carry_(—)1, . . . , a_carry_(N_(AC)−1). In step 2106, the value of each approximate carry signal a_carry_i is determined to be 1 if at least (2i+1) of y″_(w/2-2), y″_(w/2-3), . . . , y″₁ and y″₀ are 1's. In step 2108, by applying, for example, Karnaugh maps or similar methods to the result in step 2106, an approximate carry generation circuit is designed.

[0116] How to implement each of the steps of method 2100 as well as the enhanced performance obtained by fixed-width multipliers designed in accordance with method 2100 are described above, and are further illustrated by example 3.

EXAMPLE 3

[0117] Consider modified Booth multiplication with W=12. Table IX in FIG. 22 shows the rounded values of E[S_LP′_(minor)] for all the possible values of y″₄y″₃y″₂y″₁y″₀ obtained by step 2106 of the method 2100. The approximate carry signals can be obtained from Table IX in FIG. 22 as: $\begin{matrix} \begin{matrix} {{{a\_ carry}\_ 0} = {{y_{4}^{''}\bigvee y_{3}^{''}\bigvee y_{2}^{''}\bigvee y_{1}^{''}\bigvee y_{0}^{''}},}} \\ {{{a\_ carry}\_ 1} = {y_{4}^{''}{\left\{ {y_{3}^{''}{y_{2}^{''}\bigvee y_{1}^{''}}{y_{0}^{''}\bigvee\left( {y_{3}^{''}\bigvee y_{2}^{''}} \right)}\left( {y_{1}^{''}\bigvee y_{0}^{''}} \right)} \right\}\bigvee y_{3}^{\prime}}{{y_{2}^{\prime}\left( {y_{1}^{''}\bigvee y_{0}^{''}} \right)}\bigvee\left( {y_{3}^{''}\bigvee y_{2}^{''}} \right)}y_{1}^{''}y_{0}^{''}}} \\ {{{a\_ carry}\_ 2} = {y_{4}^{''}y_{3}^{''}y_{2}^{''}y_{1}^{''}{y_{0}^{''}.}}} \end{matrix} & {{EQ}.\quad (24)} \end{matrix}$

[0118] Table X in FIG. 23 compares the averages and variances of absolute error for various quantization schemes. Notice again that the average of ε by σ_(invention) is about fifty percent (50%) of that of σ_(Jou).

[0119] Larger word-length fixed-width modified Booth multipliers can be designed using the generalized approximate carry generation procedure (ACGP I) described herein. The design results for W=16 and W=20 are summarized in Table XI in FIG. 24 and Table XII in FIG. 25, respectively.

[0120] Table XIII in FIG. 26 and Table XIV in FIG. 27 show Synopsys simulation results for area and power consumption for W=10 and W=12 designs, respectively. As illustrated in Tables XIII and XIV, by using fixed-width multipliers according to the present invention, area and power consumption of modified Booth multipliers can be reduced by about thirty-five percent (35%) compared to conventional modified Booth multipliers. Notice that while there are only small differences in area and power consumption between a fixed-width multiplier according to the invention and a fixed-width multiplier according to Jou and Wang, the differences in the quantization error are significant.

[0121] Approximate Carry Generation Procedure II (ACGP II)

[0122] For large W, the Karnaugh map design approach described above may become complex. In addition, the critical path computation time of the approximate carry generation circuit increases as W increases. Notice that $\begin{matrix} {{\sum\limits_{i = 0}^{N_{{AC} - 1}}\quad {{a\_ carry}{\_ i}}} = \quad {\left\{ {\sum\limits_{i = 0}^{{W/2} - 2}\quad \frac{y_{i}^{''}}{2}} \right\}_{r}.}} & {{EQ}.\quad (25)} \end{matrix}$

[0123] Thus, to simplify the design of an implementing circuit for large W, the following approximate carry generation procedure II (ACGP II) or method 2800 can be used.

[0124]FIG. 28 is a flowchart of the steps of a generalized approximate carry generation procedure II (ACGP II) or method 2800. Method 2800 is based on the description of the present invention herein and EQ. (25). As illustrated in FIG. 28, method 2800 comprises four steps 2802, 2804, 2806, and 2808.

[0125] In step 2802, the signals in the set {y″_(w/2-2), y″_(w/2-3), . . . , y″₀} are divided into groups of three signals. If the number of signals in the set is 3N+l (l=1, 2), the last group contains only l signals. The 3N signals are added using N full adders (FA's). For l=2, the two signals in the last group are added using a half adder (HA). For l=1, the signal in the last group is passed to the next stage. The N (or N+1 for l=2) carry signals from each adder are approximate carry signals.

[0126] In step 2804, the sum signals generated in stage 1, are added using the same principle as in stage 1. The carry signals from each adder are approximate carry signals. The new sum signals are passed to the next stage.

[0127] In step 2806, the procedure of step 2804 is repeated until only one sum signal is remaining. The total number of adders used should be N_(AC) and consequently the total number of approximate carry signals is N_(AC).

[0128] In step 2808, the value 1 is added to the last adder. The addition of “1” can be done efficiently using the schemes illustrated in FIG. 29A and FIG. 29B.

[0129] Table XV in FIG. 30 shows a comparison of the approximate carry signals generated in accordance with ACGP I (i.e., method 2100) and ACGP II (i.e., method 2800) for W=8. Notice that the sum of the approximate carry signals generated by ACGP I is equal to the sum of the approximate carry signals generated by ACGP II.

[0130]FIG. 31A and FIG. 311B illustrate approximate carry generation circuits designed according to ACGP II. FIG. 31A illustrates an approximate carry generation circuit for W=10. FIG. 31B illustrates an approximate carry generation circuit for W=14. Notice that the last adders in FIG. 31A and FIG. 31B can be simplified using the schemes illustrated in FIG. 29A and FIG. 29B.

[0131] Table XVI in FIG. 32 compares Synopsys simulation results of ACGP I and ACGP II for various W values. Notice that ACGP II can be used to achieve better results if W is greater than or equal to 12.

CONCLUSION

[0132] While various embodiments of the present invention have been described above, it should be understood that they have been presented by way of example only, and not limitation. It will be understood by those skilled in the art that various changes in form and details can be made therein without departing from the spirit and scope of the invention as defined in the appended claims. Thus, the breadth and scope of the present invention should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents. 

What is claimed is:
 1. A method for fixed-width modified Booth multiplication, comprising: encoding a W-bit multiplier using modified Booth coding; processing the encoded multiplier and a multiplicand to generate partial products; and accumulating the partial products to generate a W-bit product, wherein said accumulating step comprises dividing truncated bits into two groups, a major least significant bit group and a minor least significant bit group, generating an approximate carry value using the bits of the minor least significant bit group, and generating an exact carry value for the major least significant bit group using the approximate carry value and the bits of the major least significant bit group.
 2. The method of claim 1, wherein said accumulating step comprises: using an output of a Booth encoder to generate the approximate carry value.
 3. The method of claim 1, wherein said accumulating step comprises: using a plurality of adder circuit carry signals to generate the approximate carry value.
 4. The method of claim 1, wherein said accumulating step comprises: using adder circuits to accumulate more than W most significant bits; and truncating the result of said accumulating step to W-bits.
 5. The method of claim 1, wherein said accumulating step comprises: using adder circuits to accumulate more than P most significant bits; and rounding the result of said accumulating step to P-bits.
 6. The method of claim 1, wherein said accumulating step comprises: using adder circuits to accumulate exactly W most significant bits.
 7. The method of claim 1, wherein said accumulating step comprises: using a plurality of digital logic circuits to generate the approximate carry value.
 8. A fixed-width modified Booth multiplier, comprising: a module that encodes a W-bit multiplier using modified Booth coding; a module that processes the encoded multiplier and a multiplicand to generate partial products; and a module that accumulates the partial products to generate a W-bit product, wherein said module that accumulates comprises means for associating truncated bits with a major least significant bit group or a minor least significant bit group, means for generating an approximate carry value using the bits associated with the minor least significant bit group, and means for generating an exact carry value using the approximate carry value and the bits associated with the major least significant bit group.
 9. The multiplier of claim 8, wherein said module that encodes comprises: a modified Booth encoder circuit.
 10. The multiplier of claim 8, wherein said module that processes comprises: a partial product generation circuit.
 11. The multiplier of claim 8, wherein said module that accumulates comprises: a plurality of digital logic circuits used to generate the approximated carry value.
 12. The multiplier of claim 8, wherein said module that accumulates comprises: a plurality of adder circuits used to generate the approximated carry value.
 13. A method for fixed-width multiplication, comprising: (a) processing a modified Booth encoded multiplier and a multiplicand to generate a first group of N partial products and a second group of N partial products; (b) associating each partial product of the first group of N partial products with a most significant bit group, a major least significant bit group, or a minor least significant bit group; (c) associating each partial product of the second group of N partial products with the most significant bit group or the major least significant bit group; (d) generating an approximate carry value for the minor least significant bit group; (e) generating an exact carry value for the major least significant bit group using the approximate carry value and the value of each partial product associated with the major least significant bit group; and (f) generating a product for the most significant bit group using the exact carry value and the value of each partial product associated with the most significant bit group.
 14. The method of claim 13, wherein said step of generating an approximate carry value comprises: using an output of a Booth encoder to generate the approximate carry value.
 15. The method of claim 13, wherein said step of generating an approximate carry value comprises: using a plurality of adder circuit carry signals to generate the approximate carry value.
 16. A fixed-width multiplier, comprising: a module that processes a modified Booth encoded multiplier (Y) and a multiplicand (X) to generate a first group of N partial products and a second group of N partial products; a module that associates each partial product of the first group of N partial products with a most significant bit group, a major least significant bit group, or a minor least significant bit group; a module that associates each partial product of the second group of N partial products with the most significant bit group or the major least significant bit group; a module that generates an approximate carry value for the minor least significant bit group; a module that generates an exact carry value for the major least significant bit group using the approximate carry value and the value of each partial product associated with the major least significant bit group; and a module that generates a product for the most significant bit group using the exact carry value and the value of each partial product associated with the most significant bit group.
 17. A method for designing a fixed-width multiplier, comprising: identifying a plurality of partial products formed for a W-bit multiplier and a W-bit multiplicand during modified Booth multiplication; associating each of the partial products with a most significant bit group, a major least significant bit group, or a minor least significant bit group; designing a circuit that generates an approximate carry value based on partial product values of the partial products associated with the minor least significant bit group; designing a circuit that generates an exact carry value based on partial product values of the partial products associated with the major least significant bit group and an output of the circuit that generates an approximate carry value; and designing a circuit that generates a product value based on partial product values of the partial products associated with the most significant bit group and an output of the circuit that generates an exact carry value.
 18. The method of claim 17, wherein said step of designing a circuit that generates an approximate carry value comprising: forming a plurality of coded values y″_(w/2-2), y″_(w/2-3), . . . , y″₁ and y″₀; selecting a number (N_(AC)) of approximate carry signals (a_carry_(—)0, a_carry_(—)1, . . . , a_carry_N_(AC−1)) to be generated by an approximate carry generation circuit; assigning a value of 1 to an approximate carry signal (a_carry_i) if at least “2i+1” of the coded values y″_(w/2-2), y″_(w/2-3), . . . , y″₁ and y″₀ have a value of 1; and applying a circuit design technique to the assigned values of the of approximate carry signals (a_carry_(—)0, a_carry_(—)1, . . . , a_carry_N_(AC−1)) to design the approximate carry generation circuit.
 19. The method of claim 18, wherein said step of applying a circuit design technique comprising: applying a Karnaugh map design technique.
 20. A method for fixed-width modified Booth multiplication, comprising: encoding a W-bit multiplier using modified Booth coding; processing the encoded multiplier and a multiplicand to generate partial products; and accumulating the partial products to generate a P-bit product, P being greater than W, and wherein said accumulating step comprises dividing truncated bits into two groups, a major least significant bit group and a minor least significant bit group, generating an approximate carry value using the bits of the minor least significant bit group, and generating an exact carry value for the major least significant bit group using the approximate carry value and the bits of the major least significant bit group.
 21. The method of claim 20, wherein said accumulating step comprises: using adder circuits to accumulate more than P most significant bits; and truncating the result of said accumulating step to P-bits.
 22. The method of claim 20, wherein said accumulating step comprises: using adder circuits to accumulate more than P most significant bits; and rounding the result of said accumulating step to P-bits. 